Block preconditioning for saddle point systems with indefinite (1, 1) block
نویسندگان
چکیده
منابع مشابه
Block preconditioning for saddle point systems with indefinite (1, 1) block
The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to date. The accuracy of any instructions, formulae and drug doses should be independently verified with primary sources. The publisher shall not be liable for any loss, actions, claims, proceedings, demand or costs or damages whatsoever or howsoever caused...
متن کاملA Block Preconditioning Cost Analysis For Solving Saddle-Point Linear Systems
We investigate the cost of preconditioning when solving large sparse saddlepoint linear systems with Krylov subspace methods. To use the block structure of the original matrix, we apply one of two block preconditioners. Algebraic eigenvalue analysis is given for a particular case of the preconditioners. We also give eigenvalue bounds for the preconditioned matrix when the preconditioner is bloc...
متن کاملIncomplete block factorization preconditioning for indefinite elliptic problems
The application of the finite difference method to approximate the solution of an indefinite elliptic problem produces a linear system whose coefficient matrix is block tridiagonal and symmetric indefinite. Such a linear system can be solved efficiently by a conjugate residual method, particularly when combined with a good preconditioner. We show that specific incomplete block factorization exi...
متن کاملSparse block factorization of saddle point matrices
The factorization method presented in this paper takes advantage of the special structures and properties of saddle point matrices. A variant of Gaussian elimination equivalent to the Cholesky’s factorization is suggested and implemented for factorizing the saddle point matrices block-wise with small blocks of order 1 and 2. The Gaussian elimination applied to these small blocks on block level ...
متن کاملBlock preconditioners for symmetric indefinite linear systems
This paper presents a systematic theoretical and numerical evaluation of three common block preconditioners in a Krylov subspace method for solving symmetric indefinite linear systems. The focus is on large-scale real world problems where block approximations are a practical necessity. The main illustration is the performance of the block diagonal, constrained, and lower triangular precondition...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Mathematics
سال: 2007
ISSN: 0020-7160,1029-0265
DOI: 10.1080/00207160701356605